Efficient approaches for multi-agent planning
نویسندگان
چکیده
منابع مشابه
Approaches to Multi-Agent Planning
Multi-agent planning (MAP) is a major issue in the field of distributed AI. In the multi-agent environment, each agent must consider the constraints from other agents’ actions, when planning. It’s more complicated procedure than single agent planning. The research on Multi-agent planning attracts a lot of attention of researchers from different fields, including sociology, cognitive science, ec...
متن کاملEfficient Multi-Agent Path Planning
Animating goal-driven agents in an environment with obstacles is a time consuming process, particularly when the number of agents is large. In this paper, we introduce an efficient algorithm that creates path plans for objects that move between user defined goal points and avoids collisions. In addition, the system allows “culling” of some of the computation for invisible agents: agents are acc...
متن کاملEfficient planning for real world multi-agent domains
Partially Observable Markov Decision Problems (POMDPs) and Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as popular models for sequential decision making in agents/teams of agents, operating in partially observable environments. This has been primarily because of their ability to capture the different kinds of uncertainty present in real world envir...
متن کاملDecomposition of Finite LTL Specifications for Efficient Multi-Agent Planning
Generating verifiably correct execution strategies from Linear Temporal Logic (LTL) mission specifications avoids the need for manually designed robot behaviors. However, when incorporating a team of robot agents, the additional model complexity becomes a critical issue. Given a single finite LTL mission and a team of robots, we propose an automata-based approach to automatically identify possi...
متن کاملMulti-Agent Transport Planning
We discuss a distributed transport planning problem with competitive autonomous actors that carry out time-constrained pick-up delivery orders from customers. The agents have to find conflict-free routes to execute a series of orders they have accepted. Hatzack and Nebel [2] were the first to suggest that finding such a conflict-free schedule can be reduced to solving a job shop scheduling prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge and Information Systems
سال: 2018
ISSN: 0219-1377,0219-3116
DOI: 10.1007/s10115-018-1202-1